Bibtex of Hypergraph / Independent set

@article{Boros2000a, 
     author = "Boros, E. and Gurvich, V. and Elbassioni, K. and Khachiyan, L.", 
     doi = "10.1142/S0129626400000251", 
     issn = "0129-6264", 
     journal = "Parallel Processing Letters", 
     link = "http://www.worldscientific.com/doi/abs/10.1142/S0129626400000251", 
     month = "dec", 
     number = "04", 
     pages = "253--266", 
     title = "An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension", 
     uri = "http://www.worldscientific.com/doi/abs/10.1142/S0129626400000251", 
     volume = "10", 
     year = "2000", 
}

@inproceedings{Boros2004, 
     address = "Aires, Argentina", 
     author = "Boros, Endre and Elbassioni, Khaled", 
     booktitle = "LATIN 2004: the 6th Latin American Symposium on Theoretical Informatics", 
     doi = "10.1007/978-3-540-24698-5_52", 
     editor = "Farach-Colton, Mart\'{\i}n", 
     link = "http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52", 
     month = "apr", 
     pages = "488--498", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "Generating maximal independent sets for hypergraphs with bounded edge-intersections", 
     uri = "http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52", 
     volume = "2976", 
     year = "2004", 
}